Using Dynamic Adjustment of Serialization Order for Real-Time Database Systems
نویسندگان
چکیده
Studies in [7, 8, 91 concluded that for a variety of reasons, optimistic concurrency control appears well-suited to real-time database systems. Especially, they showed that in a real-time database system that discards tardy transactions, optimistic concurrency control outperforms locking. In this paper, we show that the optimistic algorithms used in those studies incur restarts unnecessary to ensure data consistency. We present a new optimistic concurrency control algorithm that can avoid such unnecessary restarts by adjusting serialization order dynamically, and demonstrate that the new algorithm outperforms the previous ones over a wide range of system workload. It appears that this algorithm is a promising candidate for basic concurrency control mechanism for real-time database systems.
منابع مشابه
An Optimistic Concurrency Control Approach Applied to Temporal Data in Real-time Database Systems
Real-time database systems (RTDBS) have received growing attention in recent years. RTDBS is a database system where transactions have explicit timing constraints such as deadlines. The performance and the correctness of RTDBS are highly dependent on how well these deadlines can be met. Scheduling of transactions is driven by priority considerations rather than fairness considerations. Concurre...
متن کاملDynamic Adjustment of Serialization Order Using Timestamp Intervals in Real-Time Databases
Although an optimistic approach has been shown to be better than locking protocols for real-time database systems (RTDBS), it has the problems of unnecessary restarts and heavy restart overhead. In this paper, we propose a new optimistic concurrency control protocol called OCC-DATI. In OCC-DATI the number of transaction restarts is minimized by dynamic adjustment of the serialization order of t...
متن کاملUsing Real-Time Serializability and Optimistic Concurrency Control in Firm Real-Time Databases
In a real-time database system, it is difficult to meet all timing constraints due to the consistency requirements of the underlying database. Real-time database transaction scheduling requires the development of efficient concurrency control protocols that try to maximize the number of transactions satisfying their real-time constraints. However, when the transactions in the system are heterog...
متن کاملOptimistic Concurrency Control in Firm Real-Time Databases
In a real-time database system, it is difficult to meet all timing constraints due to the consistency requirements of the underlying database. Real-time database transaction scheduling requires the development of efficient concurrency control protocols that try to maximize the number of transactions satisfying their real-time constraints. However, when the transactions in the system are heterog...
متن کاملA Priority Ceiling Protocol with Dynamic Adjustment of Serialization Order
The difficulties of providing a guarantee of meeting transaction deadlines in hard real-time database systems lie in the problems of priority inversion and of deadlocks. Priority inversion and deadlock problems ensue when concurrency control protocols are adapted in priority-driven scheduling. The blocking delay due to priority inversion can be unbounded, which is unacceptable in the mission-cr...
متن کامل